◀ Prev · Parts · Full · Next ▶

cite-note-1111. ↑ Yongge Wang: Randomness and Complexity. PhD Thesis, 1996, http://webpages.uncc.edu/yonwang/papers/thesis.pdf

• citerefeagle2021Eagle, Antony (2021), "Chance versus Randomness", in Zalta, Edward N. (ed.), The Stanford Encyclopedia of Philosophy (Spring 2021 ed.), Metaphysics Research Lab, Stanford University, retrieved 2024-01-28

• citerefdowneyhirschfeldtniesterwijn2006Downey, Rod; Hirschfeldt, Denis R.; Nies, André; Terwijn, Sebastiaan A. (2006). "Calibrating Randomness". The Bulletin of Symbolic Logic. 12 (3/4): 411–491. CiteSeerX 10.1.1.135.4162. doi:10.2178/bsl/1154698741. Archived from the original on 2016-02-02.

• citerefg-cs1986Gács, Péter (1986). "Every sequence is reducible to a random one" (PDF). Information and Control. 70 (2/3): 186–192. doi:10.1016/s0019-9958(86)80004-3.

• citerefku-era1985Kučera, A. (1985). "Measure, Π0 1-classes and complete extensions of PA". Recursion Theory Week. Lecture Notes in Mathematics. Vol. 1141. Springer-Verlag. pp. 245–259. doi:10.1007/BFb0076224. ISBN 978-3-540-39596-6.

• citerefku-era1989Kučera, A. (1989). "On the use of diagonally nonrecursive functions". Studies in Logic and the Foundations of Mathematics. Vol. 129. North-Holland. pp. 219–239.

◀ Prev · Parts · Full · Next ▶